Leveraging Searchable Encryption through Homomorphic Encryption: A Comprehensive Analysis

The widespread adoption of cloud infrastructures has revolutionized data storage and access. However, it also raised concerns regarding the privacy sensitive data. To address these concerns, encryption techniques have been widely used. traditional schemes limit efficient search retrieval encrypted tackle this challenge, innovative approaches emerged, such as utilization Homomorphic Encryption (HE) in Searchable (SE) schemes. This paper provides a comprehensive analysis advancements HE-based privacy-preserving techniques, focusing on their application SE. main contributions work include identification classification existing SE that utilize HE, types HE used SE, an examination how shapes process structure enables additional functionalities, promising directions for future research findings reveal increasing usage schemes, particularly Partially Encryption. popularity type especially Paillier’s cryptosystem, can be attributed to its simplicity, proven security properties, availability open-source libraries. highlights prevalence index-based using support ranked multi-keyword queries, need further exploration functionalities verifiability ability authorize revoke users. Future exploring other alongside addressing omissions like fuzzy keyword search, leveraging recent Fully